#include<bits/stdc++.h>

using namespace std;
//杨辉三角
int a[11][11];
int n;

int main() {
    while (cin >> n) {
        memset(a, 0, sizeof(a));
        for (int i = 0; i < n; i++) {
            a[i][0] = a[i][i] = 1;
        }
        for (int i = 2; i < n; i++) {
            for (int j = 1; j < i; j++) {
                a[i][j] = a[i - 1][j - 1] + a[i - 1][j];
            }

        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j <= i; j++) {
                cout << a[i][j] << " ";
            }
            cout << endl;
        }

    }

    return 0;
}
